OWL-S Atomic services composition with SWRL rules

This paper presents a method for encoding OWL-S atomic processes by means of SWRL rules and composing them using a backward search planning algorithm. A description of the preliminary prototype implementation and a grounding in BPEL are also presented

OWL-S Atomic services composition with SWRL rules

This paper presents a method for encoding OWL-S atomic processes by means of SWRL rules and composing them using a backward search planning algorithm. A description of the preliminary prototype implementation is also presented

Semantic Web Services Ingestion in a Process Mining Framework

Process mining can be applied to systems for the management of Workflow, Business Processes and, in general, Process-Aware Information to discover and analyse implicit processes. In recent times, semantic interoperability has also become of crucial importance in the area of business processes. In particular, interoperability enables the discovery of new knowledge about processes by exploiting automatic reasoning on information originating from external formal descriptions. To this end, the use of Semantic Web technologies could be one possible solution. Given the different paradigms underpinning the two fields of research, adaptations are needed to realise this solution. In this paper, a possible mapping between Inductive Logic Programming and Semantic Web rules is proposed to discover additional knowledge that can be integrated into the process mining techniques outcomes

Experiences on the Improvement of Logic-Based Anaphora Resolution in English Texts

Anaphora resolution is a crucial task for information extraction. Syntax-based approaches are based on the syntactic structure of sentences. Knowledge-poor approaches aim at avoiding the need for further external resources or knowledge to carry out their task. This paper proposes a knowledge-poor, syntax-based approach to anaphora resolution in English texts. Our approach improves the traditional algorithm that is considered the standard baseline for comparison in the literature. Its most relevant contributions are in its ability to handle differently different kinds of anaphoras, and to disambiguate alternate associations using gender recognition of proper nouns. The former is obtained by refining the rules in the baseline algorithm, while the latter is obtained using a machine learning approach. Experimental results on a standard benchmark dataset used in the literature show that our approach can significantly improve the performance over the standard baseline algorithm used in the literature, and compares well also to the state-of-the-art algorithm that thoroughly exploits external knowledge. It is also efficient. Thus, we propose to use our algorithm as the new baseline in the literature

DOMINUSplus – An Intelligent Framework for Document Management

Store, process and manage collections of different types of documents is one of the needs of most organizations, especially universities. The management of libraries, scientific conferences, research projects are just some of the practical cases that require advanced solutions. DOMINUSplus is an open project born with the aim of harmonizing the Artificial Intelligence approaches developed at the LACAM laboratory with the research on Digital Libraries in a general software backbone for document processing and management, extensible with ad-hoc solutions for specific problems and context (such as universities)

P2P support for OWL-S discovery

The discovery of Web services is often in uenced by the rigid structure of registries containing their XML description. In recent years some methods that replace the traditional UDDI registry with Peer To Peer networks for the creation of catalogs of Web services have been proposed in order to make this structure exible and usable. This paper proposes a dierent view by placing the semantic description of services as content of P2P networks and showing that all the needed information for an ecient Web service discovery is already contained in its OWL-S description